Polynomial Time Algorithms for Multicast Network Code Construction
نویسندگان
چکیده
منابع مشابه
Polynomial-Time Construction of Linear Network Coding
Constructing k independent sessions between k source-sink pairs with the help of a linear operation at each vertex is one of the most standard problems in network coding. For an unbounded k, this is known to be NP-hard. Very recently, a polynomial-time algorithm was given for k = 2 [Wang and Shroff, ISIT 2007], but was open for a general (constant) k. This paper gives a polynomial-time algorith...
متن کاملConstruction Algorithms for Generalized Polynomial Lattice Rules
Recently, generalized digital nets were introduced and shown to achieve almost optimal convergence rates when used in a quasi-Monte Carlo algorithm to approximate high-dimensional integrals over the unit cube. Since their inception, one method of constructing generalized digital nets from classical digital nets has been known. However, the desirable features of generalized digital nets motivate...
متن کاملDistributed Asynchronous Algorithms for Multicast Network Coding
We propose distributed asynchronous algorithms for network coding in multi-source multicast networks with cycles. Our algorithms find an acyclic subset of connections between links, and set up a network code over these connections. They offer advantages in terms of link usage and coding complexity over previous distributed algorithms based on random coding, while requiring modest additional coo...
متن کاملPolynomial-Time Approximation Algorithms
• Assume that the input is random, and find an algorithm that will perform well in the average case. For example, the maximum clique problem, which is NP -hard, can actually be solved efficiently assuming a random input because the maximum clique in a randomly chosen graph is small. This assumption is often used in practice, but the problem is that not everyone will agree on whether the input d...
متن کاملAlgorithms for delay-constrained low-cost multicast tree construction
With the proliferation of multimedia group applications, the construction of multicast trees satisfying Quality of Service (QoS) requirements is becoming a problem of prime importance. Multicast groups are usually classiied as sparse or pervasive groups depending on the physical distribution of group members. They are also classiied based on the temporal characteristics of group membership into...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2005
ISSN: 0018-9448
DOI: 10.1109/tit.2005.847712